Adaptive Heuristics
نویسندگان
چکیده
We exhibit a large class of simple rules of behavior, which we call adaptive heuristics, and show that they generate rational behavior in the long run. These adaptive heuristics are based on natural regret measures, and may be viewed as a bridge between rational and behavioral viewpoints. Taken together, the results presented here establish a solid connection between the dynamic approach of adaptive heuristics and the static approach of correlated equilibria.
منابع مشابه
Five Principles for Studying People’s Use of Heuristics
The fast and frugal heuristics framework assumes that people rely on an adaptive toolbox of simple decision strategies—called heuristics—to make inferences, choices, estimations, and other decisions. Each of these heuristics is tuned to regularities in the structure of the task environment and each is capable of exploiting the ways in which basic cognitive capacities work. In doing so, heuristi...
متن کاملAdaptive particularly tunable fuzzy particle swarm optimization algorithm
Particle Swarm Optimization (PSO) is a metaheuristic optimization algorithm that owes much of its allure to its simplicity and its high effectiveness in solving sophisticated optimization problems. However, since the performance of the standard PSO is prone to being trapped in local extrema, abundant variants of PSO have been proposed by far. For instance, Fuzzy Adaptive PSO (FAPSO) algorithms ...
متن کاملAdaptive Fork-Heuristics for Software Thread-Level Speculation
Fork-heuristics play a key role in software Thread-Level Speculation (TLS). Current fork-heuristics either lack real parallel execution environment information to accurately evaluate fork points and/or focus on hardware-TLS implementation which cannot be directly applied to software TLS. This paper proposes adaptive fork-heuristics as well as a feedback-based selection technique to overcome the...
متن کاملAdaptive Strategies for Solving Constraint Satisfaction Problems
A major challenge in constraint programming is to develop efficient generic approaches to solve instances of the constraint satisfaction problem (CSP). In recent years, adaptive approaches for solving CSPs have attracted the interest of many researchers. General speaking, a strategy that uses the results of its own search experience to modify its subsequent behavior does adaptive search. In thi...
متن کاملUSING HEURISTICS for Supportability Analysis of Adaptive Weapon Systems in Combat
The new U.S. Army vision contends that heuristics are practical tools for achieving innovation. Overcoming complex terrain and adaptive hybrid threats in Syria, Iraq, and Afghanistan requires technological innovation. Supportability issues result from modifying deployed weapon systems with new technology for countering these types of threats. Collecting detailed data on deployed weapon systems ...
متن کامل